Angle-Displacement Rigidity Theory With Application to Distributed Network Localization

نویسندگان

چکیده

This article investigates the localization problem of a network in 2-D and 3-D spaces given positions anchor nodes global frame internode relative measurements local coordinate frames. It is assumed that frames different have unknown orientations. First, an angle-displacement rigidity theory developed, which can be used to localize all free by known (local position, distance, bearing, angle, or ratio-of-distance measurements). Then, necessary sufficient conditions for localizability are given. Finally, distributed protocol proposed, globally estimate locations if infinitesimally rigid. The proposed method unifies local-relative-position-based, distance-based, local-relative-bearing-based, angle-based, ratio-of-distance-based approaches. novelty this applied both generic nongeneric configurations with spaces.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Rigidity Application for Localization in WSN

Localization in WSN involves the global discovery of node coordinates. In a network topology, a few nodes are deployed to known nodal locations and remaining node nodal location information are dynamically estimated using with algorithms. The nodes of sensor network are of random type and the topology of network varied dynamically, as a result the most of the localization techniques fails in lo...

متن کامل

Universal Rigidity and Edge Sparsification for Sensor Network Localization

Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP) relaxation, to tackle the sensor network localization problem in recent years. However, a drawback of such techniques is that the resulting convex program is often expensive to solve. In order to speed up computation,...

متن کامل

Distributed Continuous-Time Protocol for Network Localization Using Angle-of-Arrival Information

In this paper, we propose a distributed continuoustime linear dynamics for solving the localization problem based on signal angle-of-arrival information. We first formulate the AOA localization problem within the framework of formation graph theory, which is an extension of the classical graph theory by incorporating the positional information of the vertices. Solving the AOA localization probl...

متن کامل

Distributed Network Localization for Wireless Sensor Networks

Recent advancements in wireless communication and microelectro-mechanical systems (MEMS) have made possible the deployment of wireless sensor networks for many real world applications. One of most challenging problems with the deployed sensor nodes is to identify their geographic locations given estimates of the distances between them. There have been a large number of localization algorithms, ...

متن کامل

Network Location Problem with Stochastic and Uniformly Distributed Demands

This paper investigates the network location problem for single-server facilities that are subject to congestion. In each network edge, customers are uniformly distributed along the edge and their requests for service are assumed to be generated according to a Poisson process. A number of facilities are to be selected from a number of candidate sites and a single server is located at each facil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2021

ISSN: ['0018-9286', '1558-2523', '2334-3303']

DOI: https://doi.org/10.1109/tac.2020.3012630